Non-Transitive Information Flow in Japanese Noun-Classifier Matching

نویسندگان

  • Roger Levy
  • David Yoshikazu Oshima
چکیده

In Japanese, as in other classifier languages like Chinese and Malay, numerals do not directly quantize nouns, but first combine with a classifier to form a measure phrase (MP; cf. Aikhenvald 2000). From the perspective of constraint-based approaches to syntax/semantics, the mutual selective restriction between classifiers and nouns can be stated in terms of informationsharing and featural identity, to some extent parallel to the treatment of gender/number agreement (between determiner and noun, for instance) (cf. Pollard and Sag 1994; Kathol 1999). There are, however, data that challenge this line of approach to noun-classifier matching. We demonstrate in this paper that it is possible that a single noun is associated with different types of classifier, and show why they are problematic for unification-based approaches, similar to the situation with case syncretism in European languages (Ingria 1990 and others). Later in the paper, we argue that information-sharing between noun, predicate and classifier is not completely transitive, and present a formal analysis which models multiple selectional requirements with sets.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Description of Chinese NPs using Head-Driven Phrase Structure Grammar

In Chinese, as well as in Japanese and Korean, nouns and classifiers share the co-occurrence restrictions, which are known as the noun-classifier matching. (Levy and Oshima, 2003) And this kind of agreement is the most salient feature of noun phrases, which presents a challenge for linguistic description and formalization. In this paper, we propose an analysis of Chinese NPs in the framework of...

متن کامل

The Effect of Transitive Closure on the Calibration of Logistic Regression for Entity Resolution

This paper describes a series of experiments in using logistic regression machine learning as a method for entity resolution. From these experiments the authors concluded that when a supervised ML algorithm is trained to classify a pair of entity references as linked or not linked pair, the evaluation of the model’s performance should take into account the transitive closure of its pairwise lin...

متن کامل

Perfect Matchings in Edge-Transitive Graphs

We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...

متن کامل

Semantic Properties of (Non-)Floating Quantifiers and their Syntactic Implications1

It is well-known that, in Japanese, classifier phrases (ClPs) (e.g., 3 classifier) or measure phrases (MPs) (e.g., 3 liters) can ‘float’ in that they can be separated from the host noun, as in (1b) and (2b).2 ClPs and MPs in this configuration are referred to as floating quantifiers (FQs), and their non-floated counterparts in (1a) and (2a) in which ClPs or MPs are adjacent to their host noun a...

متن کامل

Detecting Errors in English Article Usage with a Maximum Entropy Classifier Trained on a Large, Diverse Corpus

One of the most difficult challenges faced by non-native speakers of English is mastering the system of English articles. We trained a maximum entropy classifier to select among a/an, the, or zero article for noun phrases, based on a set of features extracted from the local context of each. When the classifier was trained on 6 million noun phrases, its performance was correct about 88% of the t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003